Inverse median problems
نویسندگان
چکیده
منابع مشابه
Inverse median location problems with variable coordinates
Given n + 1 points in Rd with nonnegative weights, the inverse 1-median problem with variable coordinates consists in changing the coordinates of the given points at minimum cost such that a prespecified point in Rd becomes the 1-median. The cost is proportional to the increase or decrease of the corresponding point coordinate. In case that the distances between points are measured by the recti...
متن کاملAn inverse approach to convex ordered median problems in trees
The convex ordered median problem is a generalization of the median, the k-centrum or the center problem. The task of the associated inverse problem is to change edge lengths at minimum cost such that a given vertex becomes an optimal solution of the location problem, i.e., an ordered median. It is shown that the problem is NP-hard even if the underlying network is a tree and the ordered median...
متن کاملInverse p-median problems with variable edge lengths
The inverse p-median problem with variable edge lengths on graphs is to modify the edge lengths at minimum total cost with respect to given modification bounds such that a prespecified set of p vertices becomes a pmedian with respect to the new edge lengths. The problem is shown to be strongly NP-hard on general graphs and weakly NP-hard on series-parallel graphs. Therefore, the special case on...
متن کاملIll-Posed and Linear Inverse Problems
In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.
متن کاملInverse Problems Have Inverse Complexity
In this paper we show that inverting problems of higher complexity is easier than inverting problems of lower complexity. While inverting Σ i 3CNFSAT is known to be coNP-complete [6] for i = 1 we prove that it remains coNP-complete for i = 2 and is in P for all i ≥ 3. Relatedly, we show that inverting Σ i 3DNFSAT is in P for all i ≥ 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2004
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2004.03.003